Labelling of Cactus Graphs

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

L(0, 1)-Labelling of Cactus Graphs

An -labelling of a graph is an assignment of nonnegative integers to the vertices of such that the difference between the labels assigned to any two adjacent vertices is at least zero and the difference between the labels assigned to any two vertices which are at distance two is at least one. The span of an   0,1 L G G   0,1 L -labelling is the maximum label number assigned to any vertex of...

متن کامل

Broadcasting on cactus graphs

Broadcasting is the process of dissemination of a message from one vertex (called originator) to all other vertices in the graph. This task is accomplished by placing a sequence of calls between neighboring vertices, where one call requires one unit of time and each call involves exactly two vertices. Each vertex can participate in one call per one unit of time. Determination of the broadcast t...

متن کامل

Some Algorithms on Cactus Graphs

A cactus graph is a connected graph in which every block is either an edge or a cycle. In this paper we give a brief idea how to design some optimal algorithms on cactus graphs in O(n) time, where n is the total number of vertices of the graph. The cactus graph has many applications in real life problems, specially in radio communication system.

متن کامل

Centdian Computation in Cactus Graphs

This paper focuses on the centdian problem in a cactus network where a cactus network is a connected undirected graph, and any two simple cycles in the graph have at most one node in common. The cactus network has important applications for wireless sensor networks when a tree topology might not be applicable and for extensions to the ring architecture. The centdian criterion represents a conve...

متن کامل

Cactus Graphs and Some Algorithms

A cactus graph is a connected graph in which every block is either an edge or a cycle. In this paper, we consider several problems of graph theory and developed optimal algorithms to solve such problems on cactus graphs. The running time of these algorithms is O(n), where n is the total number of vertices of the graph. The cactus graph has many applications in real life problems, especially in ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mapana - Journal of Sciences

سال: 2012

ISSN: 0975-3303,0975-3303

DOI: 10.12723/mjs.23.2